Binary tree - PDFSEARCH.IO - Document Search Engine

Binary tree
Results: 953

#	Item
801	2178 AND ALL THAT N. J. A. SLOANE Abstract. For integers g ≥ 3, k ≥ 2, call a number N a (g, k)-reverse multiple if the reversal of N in base g is equal to k times N . The numbers 1089 and 2178 are the two smallest ( Add to Reading List Source URL: neilsloane.com Language: English - Date: 2013-10-13 15:00:24 Directed graph Line graph Tree Binary tree Breadth-first search Graph theory Graph operations Graph
802	24 24 Two more "trees" Computer science students often have great difficulty in explaining to their parents why they are spending so much time studying "trees" and "strings". But I must impose upon you again. There are a Add to Reading List Source URL: www.uow.edu.au Language: English - Date: 2001-01-07 17:05:01 Data management AVL tree Binary search tree B-tree Tree T-tree R-tree Search tree Tree traversal Binary trees Graph theory Computing
803	On the Multiple Gene Duplication Problem Michael Fellows1, Michael Hallett2 , and Ulrike Stege2 1 2 Dep. of Computer Science, Univ. of Victoria, Victoria, B.C. Canada V8W 3P6 Add to Reading List Source URL: taxonomy.zoology.gla.ac.uk Language: English - Date: 2007-07-24 12:39:54 Tree Binary tree Geometric group theory Group theory NP-complete problems Graph theory Theoretical computer science Mathematics
804	Memory Management in the the XML Package Add to Reading List Source URL: www.omegahat.org Language: English - Date: 2011-12-07 22:33:02 Reference counting B-tree Garbage collection XML Tree Linked list Binary tree Computing Memory management Finalizer
805	Fault-Tolerant Clustering in Ad Hoc and Sensor Networks Fabian Kuhn Microsoft Research Silicon Valley 1065 La Avenida Mountain View, CA[removed]removed] Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2006-04-05 09:53:00 Binary trees NP-complete problems Dominating set Randomized rounding Randomized algorithm Rope David Shmoys Tango tree Theoretical computer science Computational complexity theory Mathematics
806	CS255: Introduction to Cryptography Winter 2014 Assignment #1: Solutions Answer 0. Let m0 be the message “attack at dawn”, m1 be the message “attack at dusk”, and c0 , c1 be Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-02-26 12:43:20 Initialization vector One-time pad Ciphertext indistinguishability Cryptography Advantage Binary tree
807	Searching through Prague Dependency Treebank Conception and Architecture Jiˇr´ı M´ırovsk´y½, Roman Ondruˇska½ , and Daniel Pr˚usˇa¾ ½ Center for Computational Linguistics Add to Reading List Source URL: www.bultreebank.org Language: English - Date: 2003-12-07 17:05:07 Tree Netgraph Functional generative description B-tree T-tree Science Linguistics Binary trees Treebank
808	Optimizing Search Strategies in k-d Trees NEAL SAMPLE†, MATTHEW HAINES‡, MARK ARNOLD‡, TIMOTHY PURCELL† † Department of Computer Science Stanford University Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2001-04-28 03:08:51 Search algorithms Binary trees Machine learning Numerical analysis Data structures K-d tree R-tree Nearest neighbor search B-tree Information science Mathematics Computing
809	Page-level Template Detection via Isotonic Smoothing Deepayan Chakrabarti Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2007-02-22 00:37:00 B-tree Isotonic regression Segmentation Tree Splay tree Statistical classification Rope Mathematics Binary trees Statistics Data management
810	A constraint-programming approach to parsing with resource-sensitive categorial grammar Katrin Erk & Geert-Jan M. Kruijff Add to Reading List Source URL: www.cs.haifa.ac.il Language: English - Date: 2002-06-05 02:33:35 Formal grammar B-tree Parsing T-tree Computing Data management Computer programming Binary trees Knowledge representation Tree

UPDATE